Open problems from Workshop on Kernels
نویسندگان
چکیده
Treedepth-d modulator as a parameter Somnath Sikdar The recent kernelization algorithms in very general sparse graph classes such as graphs of bounded expansion use the structural parameter of a constant-treedepth modulator [1]. The parameter seems natural in these graph classes, but we have not yet investigated its full power also in general graphs. What natural problems admit a polynomial kernel with respect to this parameter in general graphs? Are there many examples of natural problem that, under this parameterization, admit a polynomial kernel in sparse graph classes, but not in general graphs?
منابع مشابه
Ensemble Kernel Learning Model for Prediction of Time Series Based on the Support Vector Regression and Meta Heuristic Search
In this paper, a method for predicting time series is presented. Time series prediction is a process which predicted future system values based on information obtained from past and present data points. Time series prediction models are widely used in various fields of engineering, economics, etc. The main purpose of using different models for time series prediction is to make the forecast with...
متن کاملFAMILIARIZING NEW STUDENTS WITH THE UNIVERSITY AND STUDY SKILLS: ONE-DAY WORKSHOP FOR MEDICAL STUDENTS IN THEIR FIRST SEMESTER
Introduction: It is essential to familiarize students with the university environment and let them reach to a level of attitude, knowledge and skill to be able to function actively in a student-centered manner. A workshop was designed for new medical students, in collaboration with senior students and office of vice-chancellor for education. The workshop was held during the third month of study...
متن کاملConvolution Kernels on Discrete Structures UCSC CRL
We introduce a new method of constructing kernels on sets whose elements are discrete structures like strings trees and graphs The method can be applied iteratively to build a kernel on a in nite set from kernels involving generators of the set The family of kernels generated generalizes the family of radial basis kernels It can also be used to de ne kernels in the form of joint Gibbs probabili...
متن کاملConvolution Kernels on Discrete Structures
We introduce a new method of constructing kernels on sets whose elements are discrete structures like strings, trees and graphs. The method can be applied iteratively to build a kernel on a innnite set from kernels involving generators of the set. The family of kernels generated generalizes the family of radial basis kernels. It can also be used to deene kernels in the form of joint Gibbs proba...
متن کاملSelected Open Problems in Discrete Geometry and Optimization
A list of questions and problems posed and discussed in September 2011 at the following consecutive events held at the Fields Institute, Toronto: Workshop on Discrete Geometry, Conference on Discrete Geometry and Optimization, and Workshop on Optimization. We hope these questions and problems will contribute to further stimulate the interaction between geometers and optimizers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013